Article 930 of rec.games.corewar: From: ajpierce@med.unc.edu (Andrew Pierce) Newsgroups: rec.games.corewar Subject: Crimp (new version) Message-ID: <1992May14.143128.12675@samba.oit.unc.edu> Date: 14 May 92 14:31:28 GMT Sender: usenet@samba.oit.unc.edu Organization: UNC-CH School of Medicine Lines: 39 Nntp-Posting-Host: salvo.med.unc.edu Here is the new version of Crimp. Basically, it is ClaMP, except incorporating the ideas from Crimp of the memory active djn and the fibonacci scanning pattern. The final kill routine has also been simplified such that there is one less executing instruction, which helps add robustness under damage. I have found that program complexity gets punished on KotH. I have also removed ClaMP from KotH. It is very similar to the Agony series of Stefan Strack, differing mainly in that Agony drops an spl carpet and ClaMP drops a spl/jmp combination. I feel that between Crimp and Agony, the category "cmp scanner" is pretty well represented, so I am giving the replicating programs a break. :-) To this end, I have also submitted a "dwarf killer" named Scizz, the source of which is in its ;strategy field. It does o.k. against scanning type programs, sux against replicators but does a real number on small, unintelligent dwarfs. By way of illustration, its record against Notepaper is 0/100/0, but its record against Dwarf Optima is 76/24/0. ;redcode verbose ;name Crimp ;author Andy Pierce ;strategy small cmp scanner ;strategy scan constant optimized ;strategy smaller ret add offset,start start cmp -284,-1 slt #15,start count djn ret,<6223 mov bomb1,@start mov bomb2,